An Improved Particle Swarm Optimization with Feasibility-Based Rules for Constrained Optimization Problems

نویسندگان

  • Chao-Li Sun
  • Jianchao Zeng
  • Jeng-Shyang Pan
چکیده

This paper presents an improved particle swarm optimization (IPSO) to solve constrained optimization problems, which handles constraints based on certain feasibility-based rules. A turbulence operator is incorporated into IPSO algorithm to overcome the premature convergence. At the same time, a set called FPS is proposed to save those locating in the feasible region. Different from the standard PSO, in IPSO is chosen from the FPS instead of the swarm. Furthermore, the mutation operation is applied to the with the maximal constraint violation value in the swarm, which can guide particles to close the feasible region quickly. The performance of IPSO algorithm is tested on a well-known benchmark suite and the experimental results show that the proposed approach is highly competitive, effective and efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

The Structure Optimization of Main Beam for Bridge Crane Based on An Improved PSO

The structure optimization of main beam is a nonlinear constrained optimization problem, which is important for bridge crane to save manufacturing cost on quality assurance. The modified particle swarm optimization (MPSO) with feasibility-based rules [1], which was advanced to solve mixed-variable optimization problems, is proposed to optimize the structure of main beam in order to find the opt...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

Comprehensive Learning Particle Swarm Optimizer for Constrained Mixed-Variable Optimization Problems

This paper presents an improved particle swarm optimizer (PSO) for solving multimodal optimization problems with problem-specific constraints and mixed variables. The standard PSO is extended by employing a comprehensive learning strategy, different particle updating approaches, and a feasibility-based rule method. The experiment results show the algorithm located the global optima in all teste...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009